A quasi-optimal sparse grids procedure for groundwater flows
نویسندگان
چکیده
In this work we explore the extension of the quasi-optimal sparse grids method proposed in our previous work “On the optimal polynomial approximation of stochastic PDEs by Galerkin and Collocation methods” to a Darcy problem where the permeability is modeled as a lognormal random field. We propose an explicit a-priori/a-posteriori procedure for the construction of such quasi-optimal grid and show its effectivenenss on a numerical example. In this approach, the two main ingredients are an estimate of the decay of the Hermite coefficients of the solution and an efficient nested quadrature rule with respect to the Gaussian weight.
منابع مشابه
Two-Dimensional Boundary-Conforming Orthogonal Grids for External and Internal Flows Using Schwarz-Christoffel Transformation
In this paper, a Schwarz-Christoffel method for generating two-dimensional grids for a variety of complex internal and external flow configurations based on the numerical integration procedure of the Schwarz-Christoffel transformation has been developed by using Mathematica, which is a general purpose symbolic-numerical-graphical mathematics software. This method is highly accurate (fifth order...
متن کاملTwo-Dimensional Boundary-Conforming Orthogonal Grids for External and Internal Flows Using Schwarz-Christoffel Transformation
In this paper, a Schwarz-Christoffel method for generating two-dimensional grids for a variety of complex internal and external flow configurations based on the numerical integration procedure of the Schwarz-Christoffel transformation has been developed by using Mathematica, which is a general purpose symbolic-numerical-graphical mathematics software. This method is highly accurate (fifth order...
متن کاملA Dynamically Adaptive Sparse Grid Method for Quasi-Optimal Interpolation of Multidimensional Analytic Functions
In this work we develop a dynamically adaptive sparse grids (SG) method for quasi-optimal interpolation of multidimensional analytic functions defined over a product of one dimensional bounded domains. The goal of such approach is to construct an interpolant in space that corresponds to the “best M -terms” based on sharp a priori estimate of polynomial coefficients. In the past, SG methods have...
متن کاملComparison of Clenshaw-Curtis and Leja quasi-optimal sparse grids for the approximation of random PDEs
In this work we compare numerically different families of nested quadrature points, i.e. the classic Clenshaw–Curtis and various kinds of Leja points, in the context of the quasi-optimal sparse grid approximation of random elliptic PDEs. Numerical evidence suggests that the performances of both families are essentially comparable within such framework.
متن کاملConvergence of quasi-optimal sparse-grid approximation of Hilbert-space-valued functions: application to random elliptic PDEs
In this work we provide a convergence analysis for the quasi-optimal version of the Stochastic Sparse Grid Collocation method we had presented in our previous work “On the optimal polynomial approximation of Stochastic PDEs by Galerkin and Collocation methods” [6]. Here the construction of a sparse grid is recast into a knapsack problem: a profit is assigned to each hierarchical surplus and onl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012